Adaptive Local Polynomial Fourier Transform in ISAR
نویسندگان
چکیده
منابع مشابه
Adaptive Local Polynomial Fourier Transform in ISAR
The adaptive local polynomial Fourier transform is employed for improvement of the ISAR images in complex reflector geometry cases, as well as in cases of fast maneuvering targets. It has been shown that this simple technique can produce significantly improved results with a relatively modest calculation burden. Two forms of the adaptive LPFT are proposed. Adaptive parameter in the first form i...
متن کاملOn uncertainty principle of the local polynomial Fourier transform
In this article, a comprehensive study on uncertainty principle of the local polynomial Fourier transform (LPFT) is presented. It shows that the uncertainty product of the LPFT of an arbitrary order is related to the parameters of the signal and the window function, in addition to the errors of estimating the polynomial coefficients. Important factors that affect resolutions of signal represent...
متن کاملPolynomial Phase Estimation Based on Adaptive Short-Time Fourier Transform
Polynomial phase signals (PPSs) have numerous applications in many fields including radar, sonar, geophysics, and radio communication systems. Therefore, estimation of PPS coefficients is very important. In this paper, a novel approach for PPS parameters estimation based on adaptive short-time Fourier transform (ASTFT), called the PPS-ASTFT estimator, is proposed. Using the PPS-ASTFT estimator,...
متن کاملSystematic analysis of uncertainty principles of the local polynomial Fourier transform
In this paper, we show that there are a number of uncertainty principles for the local polynomial Fourier transform and local polynomial periodogram. Systematic analysis of uncertainty principles is given, explicit expressions of the uncertainty relations are derived, and an example using the chirp signal and the Gaussian window function is given to verify the expressions.
متن کاملPolynomial representation, Fourier transform and complexity of Boolean functions
We study the Log-rank Conjecture for XOR functions and the Sensitivity Conjecture by exploiting structure of the Fourier transform and polynomial representations of Boolean functions. For the Log-rank Conjecture for XOR functions, we show that the it is true for functions with small spectral norm or low F2-degree. More precisely, we prove the following two bounds. 1. CC(f(x⊕ y)) = O(‖f̂‖1 · log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2006
ISSN: 1687-6172,1687-6180
DOI: 10.1155/asp/2006/36093